Shidlovskii irreducibility
نویسندگان
چکیده
منابع مشابه
The Siegel-shidlovskii Theorem Revisited
Using Y.André's result on differential equations staisfied by E-functions, we derive an improved version of the Siegel-Shidlovskii theorem. It gives a complete characterisation of algebraic relations over the algebraic numbers between values of E-functions at any non-zero algebraic point.
متن کاملClique Irreducibility and Clique Vertex Irreducibility of Graphs
A graphs G is clique irreducible if every clique in G of size at least two, has an edge which does not lie in any other clique of G and is clique reducible if it is not clique irreducible. A graph G is clique vertex irreducible if every clique in G has a vertex which does not lie in any other clique of G and clique vertex reducible if it is not clique vertex irreducible. The clique vertex irred...
متن کاملIrreducibility in RNA structures.
In this paper, we study irreducibility in RNA structures. By RNA structure, we mean RNA secondary as well as RNA pseudoknot structures as abstract contact structures. We give an analysis contrasting random and minimum free energy (mfe) configurations and secondary versus pseudoknots structures. In the process, we compute various distributions: the numbers of irreducible substructures and their ...
متن کاملIrreducibility of Hypersurfaces
Given a polynomial P in several variables over an algebraically closed field, we show that except in some special cases that we fully describe, if one coefficient is allowed to vary, then the polynomial is irreducible for all but at most deg(P ) − 1 values of the coefficient. We more generally handle the situation where several specified coefficients vary.
متن کاملUnpredictability and Computational Irreducibility
We explore several concepts for analyzing the intuitive notion of computational irreducibility and we propose a robust formal definition, first in the field of cellular automata and then in the general field of any computable function f from N to N. We prove that, through a robust definition of what means "to be unable to compute the n th step without having to follow the same path than simulat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indagationes Mathematicae
سال: 1994
ISSN: 0019-3577
DOI: 10.1016/0019-3577(94)90017-5